@article{b:mac,
  author = {Fedor V. Fomin and
            Fabrizio Grandoni and
            Dieter Kratsch},
  title  = {A Measure and Conquer Approach for the Analysis of Exact Algorithms},
  year   = {2007}
}

@inproceedings{b:polyMsc,
    author    = {Rong-chii Duh and Martin F\"urer},
    title     = {Approximation of  k -Set Cover by Semi-Local Optimization},
    booktitle = {{ACM} Symposium on Theory of Computing},
    pages     = {256-264},
    year      = {1997},
    url       = {citeseer.ist.psu.edu/duh97approximation.html} 
}

@article{b:polyMscFreq,
  author    = {Dorit S. Hochbaum},
  title     = {Approximation Algorithms for the Set Covering and Vertex
               Cover Problems},
  journal   = {SIAM J. Comput.},
  volume    = {11},
  number    = {3},
  year      = {1982},
  pages     = {555-556},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{b:hybrid,
  author    = {Virginia Vassilevska and
               Ryan Williams and
               Shan Leung Maverick Woo},
  title     = {Confronting hardness using a hybrid approach},
  booktitle = {SODA},
  year      = {2006},
  pages     = {1-10},
  ee        = {http://doi.acm.org/10.1145/1109557.1109558},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{b:inclusionExclusion,
  author    = {Andreas Bj{\"o}rklund and
               Thore Husfeldt},
  title     = {Inclusion--Exclusion Algorithms for Counting Set Partitions},
  booktitle = {FOCS},
  year      = {2006},
  pages     = {575-582},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.41},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{b:setCoverApprxHardness,
  author    = {Uriel Feige},
  title     = {A Threshold of ln {\it } for Approximating Set Cover (Preliminary
               Version)},
  booktitle = {STOC},
  year      = {1996},
  pages     = {314-318},
  ee        = {http://doi.acm.org/10.1145/237814.237977},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{b:indSetApprxHardness,
  author    = {Johan H{\aa}stad},
  title     = {Clique is hard to approximate within n$^{\mbox{1-epsilon}}$},
  journal   = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume    = {4},
  number    = {38},
  year      = {1997},
  ee        = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-038/index.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{b:polyMis,
  author    = {Piotr Berman and
               Toshihiro Fujito},
  title     = {On Approximation Properties of the Independent Set Problem
               for Low Degree Graphs},
  journal   = {Theory Comput. Syst.},
  volume    = {32},
  number    = {2},
  year      = {1999},
  pages     = {115-132},
  ee        = {http://link.springer.de/link/service/journals/00224/bibs/32n2p115.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{b:expapx,
  author    = {Marek Cygan and Lukasz Kowalik and Marcin Pilipczuk and Mateusz Wykurz},
  title     = {Exponential-Time Approximation of Hard Problems},
  year      = {2008},
}

@article{b:recurrences,
  author    = {George S. Lueker},
  title     = {Some Techniques for Solving Recurrences},
  journal   = {ACM Comput. Surv.},
  volume    = {12},
  number    = {4},
  year      = {1980},
  pages     = {419-436},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}